Generalization of Halfspace Depth

نویسنده

  • O. Vencálek
چکیده

A data depth is one of the most important concepts of nonparametric multivariate analysis. Several depth functions have been introduced since 1980. The halfspace depth is probably the most popular. This depth function has many desirable properties (they are stated in the general definition of statictical depth function). We show a way of generalization of the halfspace depth finding a broader class of depth functions. We introduced several examples and observe differences between usual halfspace depth and the band depth which is a member of the class of generalized halfspace depth functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Probabilities for Halfspace Depth

Data depth functions are a generalization of one-dimensional order statistics and medians to real spaces of dimension greater than one; in particular, a data depth function quantifies the centrality of a point with respect to a data set or a probability distribution. One of the most commonly studied data depth functions is halfspace depth. It is of interest to computational geometers because it...

متن کامل

Halfspace Depth and Regression Depth Characterize the empirical Distribution

For multivariate data, the halfspace depth function can be seen as a natural and affine equivariant generalization of the univariate empirical cdf. For any multivariate data set, we show that the resulting halfspace depth function completely determines the empirical distribution. We do this by actually reconstructing the data points from the depth contours. The data need not be in general posit...

متن کامل

Weighted Data Depth and Its Properties

The paper deals with nonparametric methods for analysis of multivariate data. Generalization of the halfspace depth, so called weighted halfspace depth, is indroduced. We consider its properties with respect to the weight function in its definition. One particular property of our interest: points out of the support of probability measure should have depth equal to zero.

متن کامل

A Branch and Cut Algorithm for the Halfspace Depth Problem

In non-parametric statistics, no assumption is made about the probability distribution of the population, and the test statistics are usually based on the rank of the data. In multivariate data analysis, every data item consists of several elements (i.e. is an n-tuple). The concept of data depth in non-parametric multivariate statistics is the generalization of the univariate rank method. Given...

متن کامل

Generalizing Halfspaces Generalizing Halfspaces

Restricted-orientation convexity is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We have studied the properties of restricted-orientation convex sets and demonstrated that this notion is a generalization of standard convexity. We now describe a restricted-orientation generalization of halfspaces and explore properties of these generaliz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008